On Coloring Random Subgraphs of a Fixed Graph
نویسنده
چکیده
Given a graph G we study the chromatic number of a random graph G1/2 obtained from G by removing each edge of G independently with probability 1/2. Studying χ(G1/2) has been suggested by Bukh [Buk], who asked whether E[χ(G1/2)] > Ω(χ(G)/ log(χ(G))) holds for all graphs G. In this paper we prove several results related this problem. Denoting the chromatic number of G by k = χ(G) we prove the following results. 1. For all d 6 k1/3 it holds that Pr[χ(G1/2) 6 d] < exp (
منابع مشابه
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints
We consider a canonical Ramsey type problem. An edge-coloring of a graph is called m-good if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m,G) denote the smallest n such that every m-good edge-coloring of Kn yields a properly edgecolored copy of G, and let g(m,G) denote the smallest n such that every m-good edge-coloring of Kn yields a rain...
متن کاملRandom Graphs with a Fixed Degree Sequence
Classical Ramsey-theoretic questions on graphs involve coloring the edges of a graph with a fixed number of colors, say k, and determining whether a given monochromatic subgraph exists [13]. Anti-Ramsey questions, on the other hand, consider other restrictions on the colorings (for example, using each color at most b times [17]), and search for subgraphs in which no color is repeated [10]. An e...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملAvoiding rainbow induced subgraphs in edge-colorings
Let H be a fixed graph on k vertices. For an edge-coloring c of H , we say that H is rainbow, or totally multicolored if c assigns distinct colors to all edges of H . We show, that it is easy to avoid rainbow induced graphs H . Specifically, we prove that for any graph H (with some notable exceptions), and for any graphs G, G 6= H , there is an edge-coloring of G with k colors which contains no...
متن کاملGames on Graphs
We introduce and study Maker-Breaker positional games on random graphs. Our goal is to determine the threshold probability p F for the existence of Maker's strategy to claim a member of F in the unbiased (one-on-one) game played on the edges of the random graph G(n, p), for various target families F of winning sets. More generally, for each probability above this threshold we study the smallest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1612.04319 شماره
صفحات -
تاریخ انتشار 2016